Some Multiobjective Optimizers are Better than Others

نویسندگان

  • David Corne
  • Joshua Knowles
چکیده

The No-Free-Lunch (NFL) theorems hold for general multiobjective fitness spaces, in the sense that, over a space of problems which is closed under permutation, any two algorithms will produce the same set of multiobjective samples. However, there are salient ways in which NFL does not generally hold in multiobjective optimization. Previously we have shown that a ‘free lunch’ can arise when comparative metrics (rather than absolute metrics) are used for performance measurement. Here we show that NFL does not generally apply in multiobjective optimization when absolute performance metrics are used. This is because multiobjective optimizers usually combine a generator with an archiver. The generator corresponds to the ‘algorithm’ in the NFL sense, but the archiver filters the sample generated by the algorithm in a way that undermines the NFL assumptions. Essentially, if two multiobjective approaches have different archivers, their average performance may differ. We prove this, and hence show that we can say, without qualification, that some multiobjective approaches are better than others.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Performance Assessment and Comparison of Stochastic Multiobjective Optimizers

This work proposes a quantitative, non-parametric interpretation of statistical performance of stochastic multiobjective optimizers, including, but not limited to, genetic algorithms. It is shown that, according to this interpretation, typical performance can be defined in terms analogous to the notion of median for ordinal data, as can other measures analogous to other quantiles. Non-parametri...

متن کامل

A Bug in the Multiobjective Optimizer IBEA: Salutary Lessons for Code Release and a Performance Re-Assessment

The Indicator-Based Evolutionary Algorithm (IBEA) is one of the first indicator-based multiobjective optimization algorithms and due to its wide availability in several algorithm packages is often used as a reference algorithm when benchmarking multiobjective optimizers. The original publication on IBEA proposes to use two specific variants: one based on the ε-indicator and one based on the hyp...

متن کامل

A Computer Engineering Benchmark Application for Multiobjective Optimizers

Among the various benchmark problems designed to compare and evaluate the performance of multiobjective optimizers, there is a lack of real-world applications that are commonly accepted and, even more important, are easy to use by different research groups. The main reason is, in our opinion, the high effort required to re-implement or adapt the corresponding programs. This chapter addresses th...

متن کامل

Analyzing Production Process Performance through Evolutionary Multiobjective Optimization

Nature-inspired computational techniques are nowadays being developed for and employed in various application domains. Evolutionary algorithms, known as general and robust optimizers, have recently been extended to deal with multiobjective optimization where search for the best among candidate solutions is performed not according to one, but multiple, usually conflicting objectives. In this pap...

متن کامل

Evolutionary Multiobjective Optimization: A Short Survey of the State-of-the-art

Many real-life problems have a natural representation in the framework of multiobjective optimization. Evolutionary algorithms are generally considered one of the most successful methods for solving the multiobjective optimization problems. In this paper we present state-of-the-art multiobjective evolutionary algorithms and briefly discuss their advantages and disadvantages. In the last section...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003